Bounds on the Overflow Probability in Jackson Networks
نویسنده
چکیده
We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply the stronger logarithmic limit than that in Glasserman and Kou(1995) when several nodes have the same maximal load.
منابع مشابه
Asymptotics of overflow probabilities in Jackson networks
We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply a stronger logarithmic limit when multiple nodes have the same maximal load.
متن کاملImportance sampling for Jackson networks with customer impatience until the end of service
Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. The standard approach, which simulates the system using an a priori fixed change of measure, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queuing theory, and in applied probabilit...
متن کاملOn the queue-overflow probabilities of a class of distributed scheduling algorithms
In this paper, we are interested in using large-deviations theory to characterize the asymptotic decay-rate of the queue-overflow probability for distributed wireless scheduling algorithms, as the overflow threshold approaches infinity. We consider ad-hoc wireless networks where each link interferes with a given set of other links, and we focus on a distributed scheduling algorithm called Q-SCH...
متن کاملOptimal Sampling of Overflow Paths in Jackson Networks
We consider the problems of computing overflow probabilities at level N in any subset of stations in a Jackson network and of simulating sample paths conditional on overflow. We construct algorithms that take O (N) function evaluations to estimate such overflow probabilities within a prescribed relative accuracy and to simulate paths conditional on overflow at level N . The algorithms that we p...
متن کاملLarge Deviations Bounds for a Polling System with Markovian On/off Sources and Bernoulli Service Schedule
In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedul...
متن کامل